Linear Logical Characterization of Polyspace Functions
نویسنده
چکیده
Light Linear Logic (LLL) of [Gir95] characterizes the polytime functions through a careful handling of structural inference rules of logic. Based on this purely logical approach, we give a characterization of the polyspace functions. Our logical system is an extension of Intuitionistic Light A ne Logic (ILAL) of [Asp98], a variant of LLL with full (unrestricted) weakening. We introduce the notion of split terms and enrich ILAL by allowing a !box to be formed from a split term. The resulting system, called Intuitionistic Polyspace A ne Logic, precisely characterizes the polyspace functions.
منابع مشابه
Formalizing Termination Proofs under Polynomial Quasi-interpretations
It is known that (i) programs can be executed in polynomial space if they are compatible with lexicographic path orders (LPOs) and admit polynomial quasi-interpretations (PQIs), and (ii) LPO-termination proofs can be formalized in the Σ2-induction fragment of Peano arithmetic. We show that LPO-termination proofs can be formalized in the second order system U2 of bounded arithmetic if the compat...
متن کاملCharacterizing sub-topical functions
In this paper, we first give a characterization of sub-topical functions with respect to their lower level sets and epigraph. Next, by using two different classes of elementary functions, we present a characterization of sub-topical functions with respect to their polar functions, and investigate the relation between polar functions and support sets of this class of functions. Finally, we obtai...
متن کاملAlgebraic and Logical Characterizations of Deterministic Linear Time Classes
In this paper an algebraic characterization of the class DLIN of functions that can be computed in linear time by a deterministic RAM using only numbers of linear size is given. This class was introduced by Grand-jean, who showed that it is robust and contains most computational problems that are usually considered to be solvable in deterministic linear time. The characterization is in terms of...
متن کاملStatic Analysis of Dynamic Properties - Automatic Program Verification to Prove the Absence of Dynamic Runtime Errors
This paper introduces formal verification techniques applied by PolySpace Verifier as a static approach to measure dynamic software quality attributes. It is proving the correctness of atomic operations in the source code in regards to run-time errors. PolySpace is unique in assessing dynamic properties with a static analysis of the source code. The document outlines the use of the results duri...
متن کاملUsing a Diagnostic Corpus of C Programs to Evaluate Buffer Overflow Detection by Static Analysis Tools*
A corpus of 291 small C-program test cases was developed to evaluate static and dynamic analysis tools designed to detect buffer overflows. The corpus was designed and labeled using a new, comprehensive buffer overflow taxonomy. It provides a benchmark to measure detection, false alarm, and confusion rates of tools, and also suggests areas for tool enhancement. Experiments with five tools demon...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2000